Balanced Words and majorization

نویسنده

  • Oliver Jenkinson
چکیده

Write |w| = m, the length of w, and |w|1 = card({1 ≤ i ≤ m : wi = 1}) its 1-length. Define the cyclic shift σ : {0, 1}m → {0, 1}m by σ(w1 . . . wm) = w2 . . . wmw1. A cyclic subword of w is any length-q prefix of some σi−1(w), 1 ≤ i, q ≤ m. To any word w = w1 . . . wm we associate its orbit O(w), the vector O(w) = (O1(w), . . . ,Om(w)) consisting of the iterated cyclic shifts w, σ(w), . . . , σm−1(w) arranged in lexicographic order O1(w) ≤ O2(w) ≤ . . . ≤ Om(w) . (1)

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Majorization framework for balancedlattice designs

This paper aims to generalize and unify classical criteria for comparisons of balanced lattice designs, including fractional factorial designs, supersaturated designs and uniform designs. We present a general majorization framework for assessing designs, which includes a stringent criterion of majorization via pairwise coincidences and flexible surrogates via convex functions. Classical orthogo...

متن کامل

Statistical Functionals Consistent with a Weak Relative Majorization Ordering: Applications to the Mimimum Divergence Estimation

Most of the statistical estimation procedures are based on a quite simple principle: find the distribution that, within a certain class, is as similar as possible to the empirical distribution, obtained from the sample observations. This leads to the minimization of some statistical functionals, usually interpreted ad measures of distance or divergence between distributions. In this paper we st...

متن کامل

Linear preservers of g-row and g-column majorization on M_{n,m}

Let A and B be n × m matrices. The matrix B is said to be g-row majorized (respectively g-column majorized) by A, if every row (respectively column) of B, is g-majorized by the corresponding row (respectively column) of A. In this paper all kinds of g-majorization are studied on Mn,m, and the possible structure of their linear preservers will be found. Also all linear operators T : Mn,m ---> Mn...

متن کامل

Balanced clusters and diffusion process in signed networks

In this paper we study the topology effects on diffusion process in signed networks. Considering a simple threshold model for diffusion process, it is extended to signed networks and some appropriate definitions are proposed. This model is a basic model that could be extended and applied in analyzing dynamics of many real phenomena such as opinion forming or innovation diffusion in social netwo...

متن کامل

Latin-majorization and its linear preservers

In this paper we study the concept of Latin-majorizati-\on. Geometrically this concept is different from other kinds of majorization in some aspects. Since the set of all $x$s Latin-majorized by a fixed $y$ is not convex, but, consists of union of finitely many convex sets. Next, we hint to linear preservers of Latin-majorization on $ mathbb{R}^{n}$ and ${M_{n,m}}$.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Math., Alg. and Appl.

دوره 1  شماره 

صفحات  -

تاریخ انتشار 2009